Z - Iteration : E cient Estimation of Instantaneous Measures inTime - Dependent Multi - Class SystemsIbrahim
نویسندگان
چکیده
Multiple-class multiple-resource (MCMR) systems, where each class of customers requires a particular set of resources, are common. These systems are often analyzed under steady-state conditions. We describe a simple numerical-analytical method, referred to as Z-iteration, to estimate instantaneous (and steady-state) probability measures of time-dependent systems. The key idea is to approximate the relationship between certain instantaneous measures by the relationship between their steady-state counterparts, and use this approximation to solve dynamic ow equations. We show the generality of the Z-iteration by applying it to an integrated communication network, a parallel database server, and a distributed batch system. Validations against exact numerical solutions and discrete-event simulations show the accuracy and computational advantages of the Z-iteration.
منابع مشابه
Z - Iteration : E cient Estimation of Instantaneous Measures inTime - Dependent Multi - Class Systems
Multiple-class multiple-resource (MCMR) systems, where each class of customers requires a particular set of resources, are common. These systems are often analyzed under steady-state conditions. We describe a simple numerical-analytical method, referred to as Z-iteration, to estimate instantaneous (and steady-state) probability measures of time-dependent systems. The key idea is to approximate ...
متن کاملZ-iteration: Eecient Estimation of Instantaneous Measures in Time-dependent Multi-class Systems
Multiple-class multiple-resource (MCMR) systems, where each class of customers requires a particular set of resources, are common. These systems are often analyzed under steady-state conditions. We describe a simple numerical-analytical method, referred to as Z-iteration, to estimate instantaneous (and steady-state) probability measures of time-dependent systems. The key idea is to approximate ...
متن کاملAn Example of Data Dependence Result for The Class of Almost Contraction Mappings
In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. F...
متن کاملA new iteration method for solving a class of Hammerstein type integral equations system
In this work, a new iterative method is proposed for obtaining the approximate solution of a class of Hammerstein type Integral Equations System. The main structure of this method is based on the Richardson iterative method for solving an algebraic linear system of equations. Some conditions for existence and unique solution of this type equations are imposed. Convergence analysis and error bou...
متن کاملE cient approximation of Sturm { Liouville problems using Lie - group methods
We present a new approach to the numerical solution of Sturm{Liouville eigenvalue problems based on Magnus expansions. Our algorithms are closely related to Pruess' methods [Pre73], but provide for high order approximations at nearly the same cost as the second-order Pruess method. By using Newton iteration to solve for the eigenvalues, we are able to present an e cient algorithm for computing ...
متن کامل